Linkless symmetric drawings of series parallel digraphs
نویسندگان
چکیده
In this paper, we present a linear time algorithm for constructing linkless drawings of series parallel digraphs with maximum number of symmetries. Linkless drawing in three dimensions is a natural extension to planar drawing in two dimensions. Symmetry is one of the most important aesthetic criteria in graph drawing. More specifically, we present two algorithms: a symmetry finding algorithm which finds maximum number of three dimensional symmetries, and a drawing algorithm which constructs linkless symmetric drawings of series parallel digraphs in three dimensions. 2004 Elsevier B.V. All rights reserved.
منابع مشابه
Drawing series parallel digraphs symmetrically
In this paper we present algorithms for drawing series parallel digraphs with as much symmetry as possible. The first step is to compute a certain kind of automorphism, called an “upward planar automorphism” for an input series parallel digraph. The next step uses these automorphisms to construct a symmetric drawing of the graph. We present several variations of the second step, with visibility...
متن کاملKnuthian Drawings of Series-Parallel Flowcharts
Inspired by a classic paper by Knuth, we revisit the problem of drawing flowcharts of loopfree algorithms, that is, degree-three series-parallel digraphs. Our drawing algorithms show that it is possible to produce Knuthian drawings of degree-three series-parallel digraphs with good aspect ratios and small numbers of edge bends.
متن کامل1-Bend Upward Planar Drawings of SP-Digraphs
It is proved that every series-parallel digraph whose maximum vertex-degree is ∆ admits an upward planar drawing with at most one bend per edge such that each edge segment has one of ∆ distinct slopes. This is shown to be worst-case optimal in terms of the number of slopes. Furthermore, our construction gives rise to drawings with optimal angular resolution π ∆ . A variant of the proof techniqu...
متن کاملUpward Planar Drawings of Series-Parallel Digraphs with Maximum Degree Three
An upward planar drawing of a digraph G is a planar drawing of G where every edge is drawn as a simple curve monotone in the vertical direction. A digraph is upward planar if it has an embedding that admits an upward planar drawing. The problem of testing whether a digraph is upward planar is NP-complete. In this paper we give a linear-time algorithm to test the upward planarity of a series-par...
متن کاملD - Width , Metric Embedding , and Their Connections
Embedding between metric spaces is a very powerful algorithmic tool and has been used for finding good approximation algorithms for several problems. In particular, embedding to an l1 norm has been used as the key step in an approximation algorithm for the sparsest cut problem. The sparsest cut problem, in turn, is the main ingredient of many algorithms that have a divide and conquer nature and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Comput. Geom.
دوره 29 شماره
صفحات -
تاریخ انتشار 2004